Maker-Breaker metric resolving games on graphs

Let [Formula: see text] denote the length of a shortest path between vertices and in graph with vertex set text]. For positive integer text], let A is distance-[Formula: resolving if for distinct In this paper, we study maker-breaker game (MB[Formula: text]RG) played on by two players, Maker Breaker, who alternately select not yet chosen. wins selecting which form whereas Breaker preventing from winning. We outcome MB[Formula: text]RG. respectively, Maker, first player has winning strategy Given parameter non-decreasing function codomain exhibit pairs such that ordered pair realizes each member text]; provide graphs Moreover, obtain some general results text]RG classes.